Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity
نویسندگان
چکیده
منابع مشابه
Short PCPs with Polylog Query Complexity
We give constructions of probabilistically checkable proofs (PCPs) of length n · polylog n proving satisfiability of circuits of size n that can verified by querying polylog n bits of the proof. We also give analogous constructions of locally testable codes (LTCs) mapping n information bits to n · polylog n bit long codewords that are testable with polylog n queries. Our constructions rely on n...
متن کاملApproximating PageRank locally with sublinear query complexity
The problem of approximating the PageRank score of a node with minimal information about the rest of the graph has attracted considerable attention in the last decade; but its central question, whether it is in general necessary to explore a non-vanishing fraction of the graph, remained open until now (only for specific graphs and/or nodes was a solution known). We present the first algorithm t...
متن کاملInteractive Oracle Proofs with Constant Rate and Query Complexity
We study interactive oracle proofs (IOPs) [BCS16, RRR16], which combine aspects of probabilistically checkable proofs (PCPs) and interactive proofs (IPs). We present IOP constructions and techniques that let us achieve tradeoffs in proof length versus query complexity that are not known to be achievable via PCPs or IPs alone. Our main results are: 1. Circuit satisfiability has 3-round IOPs with...
متن کاملA Note on high-rate Locally Testable Codes with sublinear query complexity
Inspired by recent construction of high-rate locally correctable codes with sublinear query complexity due to Kopparty, Saraf and Yekhanin (2010) we address the similar question for locally testable codes (LTCs). In this note we show a construction of high-rate LTCs with sublinear query complexity. More formally, we show that for every , ρ > 0 there exists a family of LTCs over the binary field...
متن کاملSmall PCPs With Low Query
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proofsize by a large polynomial, or have a high (though constant) query complexity. In this thesis we give a transformation with slightly-super-cubic blowup in proof-size and a low query complexity. Specifically, the verifier probes the proof in 16 bits and rejects every proof of a false assertion with prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2016
ISSN: 0004-5411,1557-735X
DOI: 10.1145/2901294